CMVAE: Causal Meta VAE for Unsupervised Meta-Learning

نویسندگان

چکیده

Unsupervised meta-learning aims to learn the meta knowledge from unlabeled data and rapidly adapt novel tasks. However, existing approaches may be misled by context-bias (e.g. background) training data. In this paper, we abstract unsupervised problem into a Structural Causal Model (SCM) point out that such bias arises due hidden confounders. To eliminate confounders, define priors are conditionally independent, relationships between intervene on them with casual factorization. Furthermore, propose Meta VAE (CMVAE) encodes latent codes in causal space learns their simultaneously achieve downstream few-shot image classification task. Results toy datasets three benchmark demonstrate our method can remove it outperforms other state-of-the-art algorithms because of bias-removal. Code is available at https://github.com/GuodongQi/CMVAE.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Meta-Unsupervised-Learning: A supervised approach to unsupervised learning

We introduce a new paradigm to investigate unsupervised learning, reducing unsupervised learning to supervised learning. Specifically, we mitigate the subjectivity in unsupervised decision-making by leveraging knowledge acquired from prior, possibly heterogeneous, supervised learning tasks. We demonstrate the versatility of our framework via comprehensive expositions and detailed experiments on...

متن کامل

Hierarchical Meta-Rules for Scalable Meta-Learning

The Pairwise Meta-Rules (PMR) method proposed in [18] has been shown to improve the predictive performances of several metalearning algorithms for the algorithm ranking problem. Given m target objects (e.g., algorithms), the training complexity of the PMR method with respect to m is quadratic: ( m 2 ) = m × (m − 1)/2. This is usually not a problem when m is moderate, such as when ranking 20 dif...

متن کامل

No more meta-parameter tuning in unsupervised sparse feature learning

We propose a meta-parameter free, off-the-shelf, simple and fast unsupervised feature learning algorithm, which exploits a new way of optimizing for sparsity. Experiments on STL-10 show that the method presents state-of-the-art performance and provides discriminative features that generalize well.

متن کامل

Meta-learning and meta-optimization

Meta-learning is a method of improving results of algorithm by learning from metafeatures which describe problem instances and from results produced by various algorithms on these instances. In this project we tried to apply this idea, which was already proved to be useful in machine learning, to combinatorial optimization. We have developed a general software tool called SEAGE to extract meta-...

متن کامل

Meta-Learning Rule Learning Heuristics Meta-Learning Rule Learning Heuristics

The goal of this paper is to investigate to what extent a rule learning heuristic can be learned from experience. Our basic approach is to learn a large number of rules and record their performance on the test set. Subsequently, we train regression algorithms on predicting the test set performance from training set characteristics. We investigate several variations of this basic scenario, inclu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence

سال: 2023

ISSN: ['2159-5399', '2374-3468']

DOI: https://doi.org/10.1609/aaai.v37i8.26135